Change Point Detection using the Kantorovich Distance Algorithm
نویسندگان
چکیده
منابع مشابه
A Distance-based Kernel Change Detection Algorithm
This paper proposes a distance-based kernel change detection algorithm (DKCD). The input vectors from two images of different times are mapped into a potentially much higher dimensional feature space via a nonlinear mapping. Which will usually increase the linear separation of change and no-change regions. Then, a simple linear distance measure between two feature vectors of high dimension is d...
متن کاملChange-Point Detection using Krylov Subspace Learning
We propose an efficient algorithm for principal component analysis (PCA) that is applicable when only the inner product with a given vector is needed. We show that Krylov subspace learning works well both in matrix compression and implicit calculation of the inner product by taking full advantage of the arbitrariness of the seed vector. We apply our algorithm to a PCA-based change-point detecti...
متن کاملon the bayesian sequential change-point detection
the problems of sequential change-point have several important applications in quality control, signal processing, and failure detection in industry and finance. we discuss a bayesian approach in the context of statistical process control: at an unknown time $tau$, the process behavior changes and the distribution of the data changes from p0 to p1. two cases are considered: (i) p0 and p1 are fu...
متن کاملApproximating the step change point of the process fraction non conforming using genetic algorithm to optimize the likelihood function
Control charts are standard statistical process control (SPC) tools for detecting assignable causes. These charts trigger a signal when a process gets out of control but they do not indicate when the process change has begun. Identifying the real time of the change in the process, called the change point, is very important for eliminating the source(s) of the change. Knowing when a process has ...
متن کاملThe Kantorovich Theorem and interior point methods
The Kantorovich Theorem is a fundamental tool in nonlinear analysis which has been extensively used in classical numerical analysis. In this paper we show that it can also be used in analyzing interior point methods. We obtain optimal bounds for Newton’s method when relied upon in a path following algorithm for linear complementarity problems. Given a point z that approximates a point z(τ ) on ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC-PapersOnLine
سال: 2018
ISSN: 2405-8963
DOI: 10.1016/j.ifacol.2018.09.280